Search results for "coefficient matrix"
showing 9 items of 9 documents
The minimum mean cycle-canceling algorithm for linear programs
2022
Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…
Closed form coefficients in the Symmetric Boundary Element Approach
2006
Abstract In the area of the structural analysis, the problems connected to the use of the symmetric Galerkin Boundary Element Method (SGBEM) must be investigated especially in the mathematical and computational difficulties that are present in computing the solving system coefficients. Indeed, any coefficient is made by double integrals including often fundamental solutions having a high degree of singularity. Therefore, the related computation proves to be difficult in the solution. This paper suggests a simple computation technique of the coefficients obtained in closed form. Using a particular matrix, called ‘progenitor’ matrix [Panzeca T, Cucco F, Terravecchia S. Symmetric boundary elem…
Diffusion processes involving multiple conserved charges: a first study from kinetic theory and implications to the fluid-dynamical modeling of heavy…
2020
The bulk nuclear matter produced in heavy ion collisions carries a multitude of conserved quantum numbers: electric charge, baryon number, and strangeness. Therefore, the diffusion processes associated to these conserved charges cannot occur independently and must be described in terms of a set of coupled diffusion equations. This physics is implemented by replacing the traditional diffusion coefficients for each conserved charge by a diffusion coefficient matrix, which quantifies the coupling between the conserved quantum numbers. The diagonal coefficients of this matrix are the usual charge diffusion coefficients, while the off-diagonal entries describe the diffusive coupling of the charg…
Everywhere differentiability of viscosity solutions to a class of Aronsson's equations
2017
For any open set $\Omega\subset\mathbb R^n$ and $n\ge 2$, we establish everywhere differentiability of viscosity solutions to the Aronsson equation $$ =0 \quad \rm in\ \ \Omega, $$ where $H$ is given by $$H(x,\,p)==\sum_{i,\,j=1}^na^{ij}(x)p_i p_j,\ x\in\Omega, \ p\in\mathbb R^n, $$ and $A=(a^{ij}(x))\in C^{1,1}(\bar\Omega,\mathbb R^{n\times n})$ is uniformly elliptic. This extends an earlier theorem by Evans and Smart \cite{es11a} on infinity harmonic functions.
On necessary optimality conditions for optimal control problems governed by elliptic systems
2005
The article considers an optimal control problem for the linear elliptic system div for the case where the coefficient matrix A plays the role of control and belongs to a nonconvex set and the cost functional is a quadratic form with respect to . By transforming the original problem to a more suitable one and by using ideas from the homogenization theory a necessary optimality condition is derived.
Order optimal preconditioners for fully implicit Runge-Kutta schemes applied to the bidomain equations
2010
The partial differential equation part of the bidomain equations is discretized in time with fully implicit Runge–Kutta methods, and the resulting block systems are preconditioned with a block diagonal preconditioner. By studying the time-stepping operator in the proper Sobolev spaces, we show that the preconditioned systems have bounded condition numbers given that the Runge–Kutta scheme is A-stable and irreducible with an invertible coefficient matrix. A new proof of order optimality of the preconditioners for the one-leg discretization in time of the bidomain equations is also presented. The theoretical results are verified by numerical experiments. Additionally, the concept of weakly po…
A parallel radix-4 block cyclic reduction algorithm
2013
SUMMARY A conventional block cyclic reduction algorithm operates by halving the size of the linear system at each reduction step, that is, the algorithm is a radix-2 method. An algorithm analogous to the block cyclic reduction known as the radix-q partial solution variant of the cyclic reduction (PSCR) method allows the use of higher radix numbers and is thus more suitable for parallel architectures as it requires fever reduction steps. This paper presents an alternative and more intuitive way of deriving a radix-4 block cyclic reduction method for systems with a coefficient matrix of the form tridiag{ − I,D, − I}. This is performed by modifying an existing radix-2 block cyclic reduction me…
Higher order matrix differential equations with singular coefficient matrices
2015
In this article, the class of higher order linear matrix differential equations with constant coefficient matrices and stochastic process terms is studied. The coefficient of the highest order is considered to be singular; thus, rendering the response determination of such systems in a straightforward manner a difficult task. In this regard, the notion of the generalized inverse of a singular matrix is used for determining response statistics. Further, an application relevant to engineering dynamics problems is included.
Examining stability of independent component analysis based on coefficient and component matrices for voxel-based morphometry of structural magnetic …
2018
Independent component analysis (ICA) on group-level voxel-based morphometry (VBM) produces the coefficient matrix and the component matrix. The former contains variability among multiple subjects for further statistical analysis, and the latter reveals spatial maps common for all subjects. ICA algorithms converge to local optimization points in practice and the mostly applied stability investigation approach examines the stability of the extracted components. We found that the practically stable components do not guarantee to produce the practically stable coefficients of ICA decomposition for the further statistical analysis. Consequently, we proposed a novel approach including two steps: …